Determinacy of Adversarial Gowers Games
نویسنده
چکیده
We prove a game theoretic dichotomy for Gδσ sets of block sequences in vector spaces that extends, on the one hand, the block Ramsey theorem of W. T. Gowers proved for analytic sets of block sequences and, on the other hand, M. Davis’ proof of Σ3 determinacy.
منابع مشابه
An Exact Ramsey Principle for Block Sequences
We prove an exact, i.e., formulated without ∆-expansions, Ramsey principle for infinite block sequences in vector spaces over countable fields where the two sides of the dichotomic principle are represented by respectively winning strategies in Gowers’ block sequence game and winning strategies in the infinite asymptotic game. This allows us to recover Gowers’ dichotomy theorem for block sequen...
متن کاملBorel Determinacy of Concurrent Games
Just as traditional games can be represented by trees, so concurrent games can be represented by event structures. We show the determinacy of such concurrent games with Borel sets of configurations as winning conditions, provided they are race-free and bounded-concurrent. Both properties are shown necessary. The determinacy proof proceeds via a reduction to the determinacy of tree games, and th...
متن کاملAn Introduction to Proofs of Determinacy of Long Games
We present the basic methods used in proofs of determinacy of long games, and apply these methods to games of continuously coded length. From the dawn of time women and men have aspired upward. The development of determinacy proofs is no exception to this general rule. There has been a steady search for higher forms of determinacy, beginning with the results of Gale–Stewart [2] on closed length...
متن کاملExtending Finite Memory Determinacy to Multiplayer Games
We provide several techniques to extend finite memory determinacy from some restricted class of games played on a finite graph to a larger class. As a particular example, we study energy parity games. First we show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built fro...
متن کاملRobust Opponent Modeling in Real-Time Strategy Games using Bayesian Networks
Opponent modeling is a key challenge in Real-Time Strategy (RTS) games as the environment is adversarial in these games, and the player cannot predict the future actions of her opponent. Additionally, the environment is partially observable due to the fog of war. In this paper, we propose an opponent model which is robust to the observation noise existing due to the fog of war. In order to cope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012